Labelled quanti ed modal
نویسنده
چکیده
We present an approach to providing natural deduction style proof systems for a large class of quantiied modal logics with varying, increasing, decreasing or constant domains of quantiication. The systems we develop are modular both in the behavior of the accessibility relation and quantiication relative to the semantics, and in the proofs of soundness and completeness relative to that semantics. Our systems also provide the basis of simple implementations of quantiied modal logics in a standard logical framework theorem prover.
منابع مشابه
Concurrency with partial information
The aim of this paper is to introduce a new formalism for multi-agent systems that captures (true) concurrency and independence. We begin describing a complete and decidable propositional multi-modal logic. The language, similar to Propositional Dynamic Logic in many aspects, di ers from usual modal logic: modal operators are non-atomic (they are built out of basic actions) and capture concurre...
متن کاملConstant Domain Quanti ed Modal Logics Without Boolean Negation
There is a natural way to add rules for rst-order quanti ers to proof theories for propositional relevant logics, and there is a natural way to add evaluation conditions for quanti ers to the semantics for propositional relevant logics. Kit Fine has shown us that these two natural ways of modelling rst order relevant logics do not match up [6]. Furthermore, Fine has given a semantics for the na...
متن کاملThe Cooperative Problem-solving Process
We present a model of cooperative problem solving that describes the process from its beginning, with some agent recognising the potential for cooperation with respect to one of its goals, through to team action. Our approach is to characterise the mental states of the agents that leads them to solicit, and take part in, cooperative action. The model is formalised by expressing it as a theory i...
متن کاملQuantified Mu-Calculus for Control Synthesis
We consider an extension of the mu-calculus as a general framework to describe and synthesize controllers. This extension is obtained by quantifying atomic propositions, we call the resulting logic quanti ed mu-calculus. We study its main theoretical properties and show its adequacy to control applications. The proposed framework is expressive : it o ers a uniform way to describe as varied para...
متن کاملProviding Better Support for Quanti ed Queries
Relational database systems do not e ectively support complex queries containing quanti ers (quanti ed queries) that are increasingly becoming important in decision support applications. Generalized quanti ers provide an e ective way of expressing such queries naturally. In this paper, we consider the problem of processing quanti ed queries within the generalized quanti er framework. We demonst...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007